Strongly polynomial efficient approximation scheme for segmentation
نویسندگان
چکیده
منابع مشابه
A Polynomial - Time Subpolynom - Approximation Scheme for
The acyclic directed Steiner tree problem (ADSP) requires a minimal outward tree within an acyclic digraph with edge costs G = (V; E; d) which connects a root r with a distinguished subset S V , #S = k. The best possible performance guarantee of any polynomial approximation algorithm for ADSP cannot be less than 1 4 log k unless ~ P NP. The presented series of heuristics A n has a performance g...
متن کاملPolynomial - time Approximation Scheme for Euclidean TSP
We present a surprising result that the traveling salesman problem has a polynomial-time approximation scheme when the distances between cities are Euclidean. This result, independently due to Arora and Mitchell [1, 6], hinges on a powerful technique for randomly decomposing the given graph into regions, such that dependency amongst optimal solutions to each region has a “nice” structure. In fa...
متن کاملStrongly polynomial-time approximation for a class of bicriteria problems
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo’s parametric method we improve an earlier weakly-polynomial time algorithm.
متن کاملCsc5160: Combinatorial Optimization and Approximation Algorithms Topic: Polynomial Time Approximation Scheme 17.1 Polynomial Time Approximation Scheme 17.2 Knapsack Problem
In previous chapters we have seen the definition of a constant factor approximation algorithm. In this chapter, we will introduce the notion of a polynomial time approximation scheme (PTAS), which allows approximability to any required degree. To illustrate how PTAS works, we will study two examples, including the knapsack problem and the bin packing problem. The dynamic programming technique w...
متن کاملAn efficient polynomial time approximation scheme for load balancing on uniformly related machines
We consider basic problems of non-preemptive scheduling on uniformly related machines. For a given schedule, defined by a partition of the jobs into m subsets corresponding to the m machines, Ci denotes the completion time of machine i. Our goal is to find a schedule which minimizes or maximizes m
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2019
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2018.09.007